Motivated by applications of Gabriel graphs and Yao graphs in wireless ad-hocnetworks, we show that the maximal degree of a random Gabriel graph or Yaograph defined on $n$ points drawn uniformly at random from a unit square growsas $\Theta (\log n / \log \log n)$ in probability.
展开▼
机译：受Gabriel图和Yao图在无线ad-hocnetworks中的应用的激励，我们表明，随机从单位正方形均匀绘制的$ n $个点上定义的随机Gabriel图或Yaograph的最大程度增长为$ \ Theta（\ log n / \ log \ log n）$的概率。
展开▼
